415B - Mashmokh and Tokens - CodeForces Solution


binary search greedy implementation math *1500

Please click on ads to support us..

Python Code:

from math import ceil


def gcd(a,b):
    if b == 0:
        return a
    else:
        return gcd(b, a%b)

n,a,b=map(int,input().split())
x=list(map(int,input().split()))
for i in x:
    maxpos = (i*a)//b
    minreq = ceil((maxpos*b)/a)
        print(i-minreq,end=' ')

    

C++ Code:

#include <iostream>
#include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define endl '\n'
#define f(n) for(int i=0 ;i<n;i++)
#define fast cin.tie(0), cout.tie(0), cin.sync_with_stdio(0), cout.sync_with_stdio(0);

using namespace std;


int main()
{
    fast
    ll n,a,b; cin>>n>>a>>b;
    ll arr[n];
    f(n)cin>>arr[i];
    f(n)cout<<((arr[i]*a)%b)/a<<" ";


    return 0;
}


Comments

Submit
0 Comments
More Questions

1047B - Cover Points
1381B - Unmerge
1256A - Payment Without Change
908B - New Year and Buggy Bot
979A - Pizza Pizza Pizza
731A - Night at the Museum
742A - Arpa’s hard exam and Mehrdad’s naive cheat
1492A - Three swimmers
1360E - Polygon
1517D - Explorer Space
1230B - Ania and Minimizing
1201A - Important Exam
676A - Nicholas and Permutation
431A - Black Square
474B - Worms
987B - High School Become Human
1223A - CME
1658B - Marin and Anti-coprime Permutation
14B - Young Photographer
143A - Help Vasilisa the Wise 2
320A - Magic Numbers
1658A - Marin and Photoshoot
514A - Chewbaсca and Number
382A - Ksenia and Pan Scales
734B - Anton and Digits
1080A - Petya and Origami
1642D - Repetitions Decoding
1440A - Buy the String
1658F - Juju and Binary String
478A - Initial Bet